Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dense Message Passing for Sparse Principal Component Analysis

We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of this type. MCMC procedures are too slow to be practical in a very high-dimensional setting and standard mean-field variational Bayes algorithms are ineffective. We adopt a dense message passing algorithm similar to algo...

متن کامل

Message-Passing Algorithms for Non-Linear Nodes and Data Compression

The use of parity-check gates in information theory has proved to be very effi cient. In particular, error correcting codes based on parity checks over lowdensity graphs show excellent performances. Another basic issue of information theory, namely data compression, can be addressed in a similar way by a kind of dual approach. The theoretical performance of such a parity source coder can attain...

متن کامل

Sparse Principal Component Analysis: Algorithms and Applications

Sparse Principal Component Analysis: Algorithms and Applications

متن کامل

Mobile Agent Algorithms Versus Message Passing Algorithms

The mobile agent paradigm has been developed to solve problems in dynamic and heterogeneous environment [8]. The agent model of this paper is quite general. It is based on the concepts of agents, communication links and places. An agent is an entity which executes an algorithm: it can move from place to place (with some data and its algorithm) through communication links and it can make local c...

متن کامل

Message passing algorithms and analog electronic circuits

Solving decision problems by means of message-passing algorithms defined on graphical models has received increasing attention in recent years. The origin of this approach lies in coding theory and can be traced back to work by Gallager in 1963 and Tanner in 1981. The actual breakthrough though was marked by the discovery of turbo codes in 1993, coinciding with advances by Wiberg in graphical m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2016

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2015.2457942